Fractal Approximation and Compression Using Projected Ifs
نویسندگان
چکیده
Approximation of natural objects (curves, surfaces, or images) with fractal models is an important center of interest for research. The general inverse problem paradigm concerns many application fields and a large variety of studies have been proposed to address it.The most known of them is the fractal image compression method introduced by Jacquin. Generally speaking, these techniques lack of flexibility in term of control over the approximated shape. Furthermore, iteration space used is the visualisation space, R. Previous work achieved a general framework for fractal modeling: fractal free forms. This model allows user to define self-similar objects in a space of a higher dimension. We propose a resolution of the inverse problem based on this model and a non-linear regression algorithm. A hierachical extension of this model is introduced for modeling heterogeneous objects, for which characteristics are varying in space. A complete coding scheme has been performed on such a model showing good performances for low bitrate compression.
منابع مشابه
Fractal Compression of Images with Projected Ifs
Standard fractal image compression, proposed by Jacquin[1], is based on IFS (Iterated Function Systems) defined in R. This modelization implies restrictions in the set of images being able to be compressed. These images have to be self similar in R. We propose a new model, the projected IFS, to approximate and code grey level images. This model has the ability to define affine IFS in a high dim...
متن کاملDesign and Reconstruction of Fractal Surfaces
E. Tosan, E. Guérin and A. Baskurti LIGIM EA 1899 Computer Graphics, Image and Modeling Laboratory Claude Bernard University, Lyon, France Bât. 710 43, bd du 11 novembre 1918 69622 Villeurbanne Cedex Tel.: (33) 4.72.44.58.85 Fax : (33) 4.72.43.13.12 E-mail: [et eguerin abaskurt]@ligim.univ-lyon1.fr March 15, 2002 Abstract A method for the design and reconstruction of rough surfaces is introduce...
متن کاملA fast encoding method without search for fractal image compression
A fast coding algorithm for images using vector quantization (VQ) and pixelwise fractal approximation is proposed. The low frequency component of an input image is approximated and its residual is used to calculate the scaling factor of fractal transform. The scaling factor is compressed by transform VQ (TVQ). In the proposed method, lo encode a digital image by an iterated function system (IFS...
متن کاملA New Probabilistic Approach for Fractal Based Image Compression
Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is called iterated function system (IFS). Several algorithms, with different motivations, have been suggested towards the solution of this problem. But, so far, the theory of IFS with probabilities, in the context of image compression,...
متن کاملMathematical framework to show the existence of attractor of partitioned iterative function systems
The technique of image compression using Iterative Function System (IFS) is known as fractal image compression. An extension of IFS theory is Partitioned or local Iterative Function System (PIFS) for coding the gray level images. Several techniques of PIFS based image compression have already been proposed by many researchers. The theory of PIFS appears to be different from the theory of IFS in...
متن کامل